A parallel branch-and-bound methodfor cluster analysis
نویسندگان
چکیده
منابع مشابه
Parallel Combinatorial Search on Computer Cluster: Sam Loyd’s Puzzle
The paper investigates the efficiency of parallel branch-and-bound search on multicomputer cluster for the case of parallel solving Sam Loyd’s puzzle. Performance estimation and analysis as well as parallelism profiling have been made for MPI implementation developed on the basis of the manager/workers parallel algorithmic paradigm. The impact of the number of the processors and the computation...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملParallel branch and cut for capacitated vehicle routing
Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to parallelize, achieving scalability can be a challenge. In more sophisticated variants, such as b...
متن کاملParallel Branch and Cut for Capacitated Vehicle
Combinatorial optimization problems arise commonly in logistics applications. The most successful approaches to date for solving such problems involve modeling them as integer programs and then applying some variant of the branch and bound algorithm. Although branch and bound is conceptually easy to parallelize, achieving scalability can be a challenge. In more sophisticated variants, such as b...
متن کاملDynamic Load Balancing for Parallel Interval-Newton Using Message Passing
Branch-and-prune (BP) and branch-and-bound (BB) techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. Of special interest here are techniques derived from interval an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 90 شماره
صفحات -
تاریخ انتشار 1999